Real-time and Agent-time Constraint Satisfaction
نویسندگان
چکیده
This paper presents extensions for temporal constraints satisfaction in MIndiGolog [KP06], for both agent-time and real-time constraints. An implementation is provided in Prolog, which enables users to specify their constraints as arguments to a single entry point predicate. The results are demonstrated with practical examples, and limitations of our implementation are discussed in depth. Finally, scope for possible further work and research is provided.
منابع مشابه
Implementation of a Real-time Musical Decision-maker
In this paper, we present a novel implementation of a real-time musical decision-maker. In our scenario, the behaviour of a musical decision-making agent is specified as a constraint satisfaction problem. Generally, constraint satisfaction problems are solved using methods which are not suitable for real-time musical performance, because the amount of time they will take to arrive at a solution...
متن کاملRingomatic: A Real-Time Interactive Drummer Using Constraint-Satisfaction and Drum Sound Descriptors
We describe a real-time musical agent that generates an audio drum-track by concatenating audio segments automatically extracted from pre-existing musical files. The drum-track can be controlled in real-time by specifying high-level properties (or constraints) holding on metadata automatically extracted from the audio segments. A constraint-satisfaction mechanism, based on local search, selects...
متن کاملTracking Dynamic Team Activity
AI researchers are striving to build complex multi-agent worlds with intended applications ranging from the RoboCup robotic soccer tournaments, to interactive virtual theatre, to large-scale real-world battlefield simulations. Agent tracking monitoring other agent’s actions and inferring their higher-level goals and intentions is a central requirement in such worlds. While previous work has mos...
متن کاملA Quick Adaptation Method for Constraint Satisfaction in a Real-time Environment
Multi-agent problem solving in a real-time environment is one of the hardest and most fascinating research area. In this paper, we propose a method for quick adaptation to changes in a problem in a real-time environment as an extension of an Asynchronous Weak-commitment (AWC) search algorithm. The basic idea of our proposing method is to limit the scope of search. Variables which are affected b...
متن کاملSolving Distributed Delivery Problems with Agent-Based Technologies and Constraint Satisfaction Techniques
A considerable amount of research has been concerned with the domain of automatic planning and scheduling, but many real world scheduling problems such as The Pick up and Delivery Problem With Time Windows (PDPTW) are still not easily tackled. The PDPTW problem demands solving the schedule for each vehicle of a transportation fleet where pick up and delivery of customer orders are distributed a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007